Continuously monitoring top-k uncertain data streams: a probabilistic threshold method
نویسندگان
چکیده
منابع مشابه
Efficiently Answering Probabilistic Threshold Top - k Queries on Uncertain Data ( Extended Abstract )
In this paper, we propose a novel type of probabilistic threshold top-k queries on uncertain data, and give an exact algorithm. More details can be found in [4]. I. PROBABILISTIC THRESHOLD TOP-k QUERIES We consider uncertain data in the possible worlds semantics model [1], [5], [7], which is also adopted by some recent studies on uncertain data processing, such as [8], [2], [6]. Generally, an u...
متن کاملFinding top-k elements in data streams
Identifying the most frequent elements in a data stream is a well known and difficult problem. Identifying the most frequent elements for each individual, especially in very large populations, is even harder. The use of fast and small memory footprint algorithms is paramount when the number of individuals is very large. In many situations such analysis needs to be performed and kept up to date ...
متن کاملRanking uncertain sky: The probabilistic top-k skyline operator
Many recent applications involve processing and analyzing uncertain data. In this paper, we combine the feature of top-k objects with that of skyline to model the problem of top-k skyline objects against uncertain data. The problem of efficiently computing top-k skyline objects on large uncertain datasets is challenging in both computing the top-k skyline objects is developed for discrete cases...
متن کاملProbabilistic top-k range query processing for uncertain databases
Query processing over uncertain data is very important in many applications due to the existence of uncertainty in real-world data. In this paper, we propose a novel and important query for uncertain data, namely probabilistic top-(k, l) range (PTR) query, which retrieves l uncertain tuples that are expected to meet score range constraint [s1, s2] and have the maximum top-k probabilities but no...
متن کاملTop-k Pattern Matching Using an Information-Theoretic Criterion over Probabilistic Data Streams
As the development of data mining technologies for sensor data streams, more sophisticated methods for complex event processing are demanded. In the case of event recognition, since event recognition results may contain errors, we need to deal with the uncertainty of events. We therefore consider probabilistic event data streams with occurrence probabilities of events, and develop a pattern mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed and Parallel Databases
سال: 2009
ISSN: 0926-8782,1573-7578
DOI: 10.1007/s10619-009-7043-x